Non-interval greedoids and the transposition property

نویسندگان

  • Bernhard Korte
  • László Lovász
چکیده

In previous papers we have mainly studied greedoids with the interval property. This paper exhibits 11 classes of greedoids whose members do not necessarily have the interval property. These non-interval greedoids are related to some fundamental algorithms and procedural principles like Gaussian elimination, blossom trees, series-parallel decomposition, ear decomposition, retracting and dismantling. We introduce some weaker exchange properties. One of them can be shown to be equivalent to the greedoid exchange property. Another one leads to the definition of transposition greedoids. Besides all interval greedoids, some non-interval greedoids share the transposition property.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 M ay 2 00 8 RANDOM WALKS , ARRANGEMENTS , CELL COMPLEXES , GREEDOIDS , AND SELF - ORGANIZING LIBRARIES

The starting point is the known fact that some much-studied random walks on permutations, such as the Tsetlin library, arise from walks on real hyperplane arrangements. This paper explores similar walks on complex hyperplane arrangements. This is achieved by involving certain cell complexes naturally associated with the arrangement. In a particular case this leads to walks on libraries with sev...

متن کامل

Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-organizing Libraries

The starting point is the known fact that some much-studied random walks on permutations, such as the Tsetlin library, arise from walks on real hyperplane arrangements. This paper explores similar walks on complex hyperplane arrangements. This is achieved by involving certain cell complexes naturally associated with the arrangement. In a particular case this leads to walks on libraries with sev...

متن کامل

Characterizations of Non-simple Greedoids and Antimatroids based on Greedy Algorithms

A language containing no words with repeated elements is simple. And a language which is not necessary simple is called non-simple in this paper. Björner and Ziegler [3] presented three plausible extensions of greedoids to non-simple languages. We shall show that when choosing one of their definitions they called ’polygreedoid’ and replacing generalized bottleneck functions of the objective fun...

متن کامل

On the Algebraic Structure of Transposition Hypergroups with Idempotent Identity

This paper studies the algebraic structure of transposition hypergroups with idempotent identity. Their subhypergroups and their properties are examined. Right, left and double cosets are defined through symmetric subhypergroups and their properties are studied. Further- more, this paper examines the homomorphisms, the behaviour of attrac- tive and non-attractive elements through them, as well ...

متن کامل

Antimatroids, Betweenness, Convexity

Korte and Lovász [12, 13] founded the theory of greedoids . These combinatorial structures characterize a class of optimization problems that can be solved by greedy algorithms. In particular, greedoids generalize matroids , introduced earlier by Whitney [16]. Antimatroids , introduced by Dilworth [3] as particular examples of semimodular lattices, make up another class of greedoids. Antimatroi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 59  شماره 

صفحات  -

تاریخ انتشار 1986